A Deductive System for PC(ID)

نویسندگان

  • Ping Hou
  • Johan Wittocx
  • Marc Denecker
چکیده

The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. This paper studies a deductive inference method for PC(ID), its propositional fragment. We introduce a formal proof system based on the sequent calculus (Gentzen-style deductive system) for this logic. As PC(ID) is an integration of classical propositional logic and propositional inductive definitions, our deductive system integrates inference rules for propositional calculus and definitions. We prove the soundness and completeness of this deductive system for a slightly restricted fragment of PC(ID). We also give a counter-example to show that cut-elimination does not hold in this proof system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LPC(ID): A Sequent Calculus Proof System for Propositional Logic Extended with Inductive Definitions

The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. Such logic formally extends logic programming, abductive logic programming and datalog, and thus formalizes the view on these formalisms as logics of (generalized) inductive definitions. The goal of this paper is to study a deductive inference method for PC(ID), w...

متن کامل

A Deductive System for FO(ID) Based on Least Fixpoint Logic

The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to extend Gentzen’s sequent calculus to obtain a deductive inference method for FO(ID). The main difficulty in building such a proof system is the representation and inference of unfounded sets. It turns out that we can represent unfounde...

متن کامل

Satisfiability Checking for PC(ID)

The logic FO(ID) extends classical first order logic with inductive definitions. This paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in this logic, present an algorithm and prove its correctness. As FO(ID) is an integration of classical logic and logic programming, our algorithm integrates techniques from SAT and ASP...

متن کامل

T15-idiotype-negative B cells dominate the phosphocholine binding cells in the preimmune repertoire of T15i knockin mice.

T15i knockin (KI) mice express a H chain that is encoded by a rearranged T15 VDJ transgene which has been inserted into the J(H) region of chromosome 12. This T15H chain combines with a kappa22-33 L chain to produce a T15-Id+ Ab having specificity for phosphocholine (PC). Inasmuch as T15-Id+ Abs dominate the primary immune response to PC in normal mice, it was surprising to find that 80% of the...

متن کامل

Development and Practical Application of a Lifetime Management System for Prestressed Concrete Bridges

A practical Bridge Management System has been developed by the author, which is referred to as the Japanese Bridge Management System (J-BMS) for existing concrete bridges. This paper introduces a newly developed bridge management system for the prestressed concrete (PC) bridges (J-BMS PC version) which is integrated with the PC bridge rating expert system (PC-BREX). The proposed system is able ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007